Θ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks
نویسندگان
چکیده
This paper details a hardware implementation of distributed Θ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks constant regardless number devices same cluster. The each automatically detect its own status; slave; based on identifier without adding extra overheads exchanging packets that slow down network. We propose baseband design implements functions and we detail using Matlab/Simulink Ettus B210 USRP. Tests held laboratory prove works as expected.
منابع مشابه
A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملA New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملEvaluation of a BIBD Based Directional MAC Protocol for Wireless Ad Hoc Networks
The use of directional antennas in wireless ad hoc networks can significantly improve global performance due to a high spatial channel reuse. Nevertheless, its introduction poses new location dependent problems related to the MAC protocol. In this paper, the Balanced Incomplete Block Design theory has been exploited to develop a new MAC protocol for wireless ad hoc networks using directional ant...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2023
ISSN: ['2300-1933', '2081-8491']
DOI: https://doi.org/10.24425/ijet.2020.134008